An LP-based 3/2-approximation algorithm for the graphic s-t path TSP
نویسنده
چکیده
We design a new LP-based algorithm for the graphic s-t path Traveling Salesman Problem (TSP), which achieves the best approximation factor of 1.5. The algorithm is based on the idea of narrow cuts due to An, Kleinberg, and Shmoys. It partly answers an open question of Sebő.
منابع مشابه
Shorter Tours by Nicer Ears: 7/5-approximation for graphic TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs
We prove new results for approximating the graphic TSP and some related problems. We obtain polynomial-time algorithms with improved approximation guarantees. For the graphic TSP itself, we improve the approximation ratio to 7/5. For a generalization, the connected-T -join problem, we obtain the first nontrivial approximation algorithm, with ratio 3/2. This contains the graphic s-t-path-TSP as ...
متن کاملApproximation Algorithms for Path TSP, ATSP, and TAP via Relaxations
Linear programming (LP) relaxations provide a powerful technique to design approximation algorithms for combinatorial optimization problems. In the first part of the thesis, we study the metric s-t path Traveling Salesman Problem (TSP) via LP relaxations. We first consider the s-t path graph-TSP, a critical special case of the metric s-t path TSP. We design a new simple LP-based algorithm for t...
متن کاملOn the metric s-t path Traveling Salesman Problem
We study the metric s-t path Traveling Salesman Problem (TSP). [An, Kleinberg, and Shmoys, STOC 2012] improved on the long standing 5 3 -approximation factor and presented an algorithm that achieves an approximation factor of 1+ √ 5 2 ≈ 1.61803. Later [Sebő, IPCO 2013] further improved the approximation factor to 85 . We present a simple, self-contained analysis that unifies both results; our m...
متن کاملAn Improved Integrality Gap for Asymmetric TSP Paths
The Asymmetric Traveling Salesperson Path (ATSPP) problem is one where, given an asymmetric metric space (V, d) with specified vertices s and t, the goal is to find an s-t path of minimum length that visits all the vertices in V . This problem is closely related to the Asymmetric TSP (ATSP) problem, which seeks to find a tour (instead of an s-t path) visiting all the nodes: for ATSP, a ρ-approx...
متن کاملApproaching $\frac{3}{2}$ for the $s$-$t$-path TSP
We show that there is a polynomial-time algorithm with approximation guarantee 3 2 + ε for the s-t-path TSP, for any fixed ε > 0. It is well known that Wolsey’s analysis of Christofides’ algorithm also works for the s-t-path TSP with its natural LP relaxation except for the narrow cuts (in which the LP solution has value less than two). A fixed optimum tour has either a single edge in a narrow ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1304.7055 شماره
صفحات -
تاریخ انتشار 2013